Density-based clustering for bivariate-flow data
نویسندگان
چکیده
Geographical flows reflect the movements, spatial interactions or connections among locations and are generally abstracted as origin-destination (OD) flows. In this context, clustering is a pattern describing group of with adjacent O D points. For data composed two types (bivariate-flow data), bivariate-flow cluster comprising flows, at least one which exhibits pattern. cluster, varying flow density combinations imply different meanings. instance, high-density travel on both weekdays (type A) weekends B) may be associated entertainment, whereas sparse reveal work-related travel. However, identifying clusters still an unsolved problem. To end, we extend bivariate-point method propose density-based for bivariate The simulation experiments verify model robustness. case study, apply to extract Beijing taxi OD periods, identify work-related, tourism, egress return travels. These results demonstrate capability our in detecting clusters.
منابع مشابه
Entropy-based Consensus for Distributed Data Clustering
The increasingly larger scale of available data and the more restrictive concerns on their privacy are some of the challenging aspects of data mining today. In this paper, Entropy-based Consensus on Cluster Centers (EC3) is introduced for clustering in distributed systems with a consideration for confidentiality of data; i.e. it is the negotiations among local cluster centers that are used in t...
متن کاملAutomatic Clustering of Flow Cytometry Data with Density-Based Merging
The ability of flow cytometry to allow fast single cell interrogation of a large number of cells has made this technology ubiquitous and indispensable in the clinical and laboratory setting. A current limit to the potential of this technology is the lack of automated tools for analyzing the resulting data. We describe methodology and software to automatically identify cell populations in flow c...
متن کاملAn improved opposition-based Crow Search Algorithm for Data Clustering
Data clustering is an ideal way of working with a huge amount of data and looking for a structure in the dataset. In other words, clustering is the classification of the same data; the similarity among the data in a cluster is maximum and the similarity among the data in the different clusters is minimal. The innovation of this paper is a clustering method based on the Crow Search Algorithm (CS...
متن کاملClustering for High Dimensional Data: Density based Subspace Clustering Algorithms
Finding clusters in high dimensional data is a challenging task as the high dimensional data comprises hundreds of attributes. Subspace clustering is an evolving methodology which, instead of finding clusters in the entire feature space, it aims at finding clusters in various overlapping or non-overlapping subspaces of the high dimensional dataset. Density based subspace clustering algorithms t...
متن کاملDensity-Based Clustering Based on Probability Distribution for Uncertain Data
Today we have seen so much digital uncertain data produced. Handling of this uncertain data is very difficult. Commonly, the distance between these uncertain object descriptions are expressed by one numerical distance value. Clustering on uncertain data is one of the essential and challenging tasks in mining uncertain data. The previous methods extend partitioning clustering methods like k-mean...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Geographical Information Science
سال: 2022
ISSN: ['1365-8824', '1365-8816']
DOI: https://doi.org/10.1080/13658816.2022.2073595